Integrality Gaps of Integer Knapsack Problems
نویسندگان
چکیده
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a “typical” knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario.
منابع مشابه
An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack
In this note we study packing or covering integer programs with at most k constraints, which are also known as k-dimensional knapsack problems. For integer k > 0 and real ǫ > 0, we observe there is a polynomial-sized LP for the k-dimensional knapsack problem with integrality gap at most 1+ ǫ. The variables may be unbounded or have arbitrary upper bounds. In the (classical) packing case, we can ...
متن کاملThe Lasserre Hierarchy in Almost Diagonal Form
The Lasserre hierarchy is a systematic procedure for constructing a sequence of increasingly tight relaxations that capture the convex formulations used in the best available approximation algorithms for a wide variety of optimization problems. Despite the increasing interest, there are very few techniques for analyzing Lasserre integrality gaps. Satisfying the positive semi-definite requiremen...
متن کاملOn the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities
The Lasserre/Sum-of-Squares hierarchy is a systematic procedure to strengthen LP relaxations by constructing a sequence of increasingly tight formulations. For a wide variety of optimization problems, this approach captures the convex relaxations used in the best available approximation algorithms. The capacitated covering IP is an integer program of the form min{cx : Ux ≥ d, 0 ≤ x ≤ b, x ∈ Z+}...
متن کاملSum of squares lower bounds from symmetry and a good story
In this paper, we develop machinery for proving sum of squares lower bounds on symmetric problems based on the intuition that sum of squares has difficulty capturing integrality arguments, i.e. arguments that an expression must be an integer. Using this machinery, we prove a tight sum of squares lower bound for the following Turan type problem: Minimize the number of triangles in a graph $G$ wi...
متن کاملPolyhedral combinatorics: An annotated bibliography
The system Bx b is said to describe P , and each hyperplane fx 2 IR : B i x = big is called a cutting plane. One of the central questions in polyhedral combinatorics is to nd the cutting planes that describe P . This question is the subject of this chapter. We start with a section on books and collections of survey articles that treat polyhedral combinatorics in detail. x2 on integer programmin...
متن کامل